Optimization of Time of Day Plan Scheduling Using a Multi-Objective Evolutionary Algorithm

نویسندگان

  • Montasir M. Abbas
  • Anuj Sharma
چکیده

Coordinating traffic signals can provide great savings to motorists in terms of reduced delays and number of vehicular stops. In order to maximize benefits, engineers need to use a mechanism by which the most optimal timing plans are activated when the traffic patterns change. Common ways of accomplishing this need is by using Time of Day (TOD) plan scheduling, or Traffic Responsive Plan Selection (TRPS). Out of the two modes, the TOD mode is by far the most common. Engineers, however, typically use their judgment to determine the TOD plan scheduling. Unless traffic patterns change at certain times of the day and remain constant until the next change—which is highly unlikely—it is very difficult to determine what the optimal break point would be. In addition, engineers would also face the challenge of selecting the timing plan that would be active during every scheduling period. This paper proposes the use of a multiobjective evolutionary algorithm to address these challenges. The authors introduce the Degree of Detachment (DOD) as a performance measure of scheduling continuity. A high DOD translates into frequent changes in timing plans. Whereas a zero DOD translates into a one timing plan applied throughout the day. The authors then use a non-dominated sorting genetic algorithm (NSGAII) to optimize the TOD scheduling. This approach results in different Pareto fronts, corresponding to different DODs, where engineers can evaluate the incremental benefits associated with increasing the frequency of timing plan changes. Optimization of Time of Day Plan Scheduling Using a Multi-Objective Evolutionary Algorithm

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A New Multi-objective Job Shop Scheduling with Setup Times Using a Hybrid Genetic Algorithm

This paper  presents a new multi objective job shop scheduling with sequence-dependent setup times. The objectives are to minimize the makespan and sum of the earliness and tardiness of jobs in a time window. A mixed integer programming model is developed for the given problem that belongs to NP-hard class. In this case, traditional approaches cannot reach to an optimal solution in a reasonable...

متن کامل

A multi-objective resource-constrained optimization of time-cost trade-off problems in scheduling project

This paper presents a multi-objective resource-constrained project scheduling problem with positive and negative cash flows. The net present value (NPV) maximization and making span minimization are this study objectives. And since this problem is considered as complex optimization in NP-Hard context, we present a mathematical model for the given problem and solve three evolutionary algorithms;...

متن کامل

Multi-objective optimization of time-cost-quality-carbon dioxide emission-plan robustness in construction projects

Today, the construction industry is facing intense competition and success in this competition depends on several factors. Project managers try to minimize project time and cost, carbon dioxide emission and at the same time maximizing the quality of project and its plan robustness. In this paper, study construction project scheduling considering a discrete trade-off between time, cost, quality,...

متن کامل

Task Scheduling Using Particle Swarm Optimization Algorithm with a Selection Guide and a Measure of Uniformity for Computational Grids

In this paper, we proposed an algorithm for solving the problem of task scheduling using particle swarm optimization algorithm, with changes in the Selection and removing the guide and also using the technique to get away from the bad, to move away from local extreme and diversity. Scheduling algorithms play an important role in grid computing, parallel tasks Scheduling and sending them to ...

متن کامل

An Energy-efficient Mathematical Model for the Resource-constrained Project Scheduling Problem: An Evolutionary Algorithm

In this paper, we propose an energy-efficient mathematical model for the resource-constrained project scheduling problem to optimize makespan and consumption of energy, simultaneously. In the proposed model, resources are speed-scaling machines. The problem is NP-hard in the strong sense. Therefore, a multi-objective fruit fly optimization algorithm (MOFOA) is developed. The MOFOA uses the VIKO...

متن کامل

Task Scheduling Using Particle Swarm Optimization Algorithm with a Selection Guide and a Measure of Uniformity for Computational Grids

In this paper, we proposed an algorithm for solving the problem of task scheduling using particle swarm optimization algorithm, with changes in the Selection and removing the guide and also using the technique to get away from the bad, to move away from local extreme and diversity. Scheduling algorithms play an important role in grid computing, parallel tasks Scheduling and sending them to ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014